On the Amount of Randomness Needed in Distributed Computations
نویسندگان
چکیده
We treat the number of random bits as a computational resource in distributed computations. We give a concrete application of these ideas by characterizing the number of random bits necessary and suucient to elect a leader in an anonymous network of processors by a probabilistic algorithm with overwhelming probability. Our main result is a proof that a constant number of random bits is actually suucient to elect a leader on any network of processors.
منابع مشابه
Multi-Party Protocols, Information Complexity and Privacy
We introduce the new measure of Public Information Complexity (PIC), as a tool for the study of multi-party computation protocols, and of quantities such as their communication complexity, or the amount of randomness they require in the context of information-theoretic private computations. We are able to use this measure directly in the natural asynchronous message-passing peer-to-peer model a...
متن کاملTESTING FOR “RANDOMNESS” IN SPATIAL POINT PATTERNS, USING TEST STATISTICS BASED ON ONE-DIMENSIONAL INTER-EVENT DISTANCES
To test for “randomness” in spatial point patterns, we propose two test statistics that are obtained by “reducing” two-dimensional point patterns to the one-dimensional one. Also the exact and asymptotic distribution of these statistics are drawn.
متن کاملA New Scheduling Algorithm for General Strict Multithreaded Computations
Three important performance parameters of scheduling algorithms for multithreaded computations on parallel computers are the required space, their execution time, and the communication cost incurred during the course of an execution; the rst is characterized by the amount of storage needed for an execution, the second is the total number of steps needed for executing all threads, while the last...
متن کاملENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS
Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...
متن کاملA Randomness Test for Stable Data
In this paper, we propose a new method for checking randomness of non-Gaussian stable data based on a characterization result. This method is more sensitive with respect to non-random data compared to the well-known non-parametric randomness tests.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997